An Optimized Hybrid Approach for Path Finding
نویسندگان
چکیده
منابع مشابه
An Optimized Hybrid Approach for Path Finding
Path finding algorithm addresses problem of finding shortest path from source to destination avoiding obstacles. There exist various search algorithms namely A*, Dijkstra's and ant colony optimization. Unlike most path finding algorithms which require destination co-ordinates to compute path, the proposed algorithm comprises of a new method which finds path using backtracking without requiring ...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولAn Efficient and Complete Approach for Cooperative Path-Finding
Cooperative path-finding requires the computation of a set of compatible paths for multiple agents operating on a discrete roadmap. The goal of this problem is to navigate each agent to their unique target vertices without simultaneously occupying the same vertex or edge in the roadmap as any other agent. Such a formulation has applications in warehouse management, transportation networks, (dis...
متن کاملAn Optimized Online Secondary Path Modeling Method for Single-Channel Feedback ANC Systems
This paper proposes a new method for online secondary path modeling in feedback active noise control (ANC) systems. In practical cases, the secondary path is usually time-varying. For these cases, online modeling of secondary path is required to ensure convergence of the system. In literature the secondary path estimation is usually performed offline, prior to online modeling, where in the prop...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal in Foundations of Computer Science & Technology
سال: 2015
ISSN: 1839-7662
DOI: 10.5121/ijfcst.2015.5205